JavaNeighbors: Improving ChuckyJava’s neighborhood discovery algorithm
نویسندگان
چکیده
منابع مشابه
Improving Activity Discovery with Automatic Neighborhood Estimation
A fundamental problem for artificial intelligence is identifying perceptual primitives from raw sensory signals that are useful for higher-level reasoning. We equate these primitives with initially unknown recurring patterns called motifs. Autonomously learning the motifs is difficult because their number, location, length, and shape are all unknown. Furthermore, nonlinear temporal warping may ...
متن کاملSecure Neighborhood Discovery
The existing IETF standards specify that IPv6 Neighbor Discovery and Address Autoconfiguration mechanisms MAY be protected with IPsec AH. However, the current specifications limit the security solutions to manual keying due to practical problems faced with automatic key management. This document specifies three different trust models and discusses the threats pertinent to IPv6 Neighbor Discover...
متن کامل3D SOM Neighborhood Algorithm
Neighborhood algorithm is an important part of 3D SOM algorithm. We proposed three kinds of neighborhood shape and two kinds of neighborhood decay function for threedimensional self-organizing feature maps (3D SOM) algorithm and applied them to three-dimensional image compression coding. Experimental results show that the 3D orthogonal cross neighborhood shape and exponential function algorithm...
متن کاملOn Triangulation-based Dense Neighborhood Graphs Discovery
This paper introduces a new definition of dense subgraph pattern, the DN -graph. DN -graph considers both the size of the substructure and the minimum level of interactions between any pair of the vertices. The mining of DN -graphs inherits the difficulty of finding clique, the fully-connected subgraphs. We thus opt for approximately locating the DN -graphs using the state-of-the-art graph tria...
متن کاملNest : A Practical Algorithm for Neighborhood Discovery in Dynamic Wireless Networks using Adaptive Beaconing
Neighborhood discovery forms an essential building block for applications that operate in wireless ad-hoc scenarios. In fact, many algorithms designed for large-scale ad-hoc networks presume a ready availability of neighborhood information. In this paper, we address the issue of fast gathering neighborhood information in a dynamic network, characterized by node mobility. As the main contributio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2019
ISSN: 1877-0509
DOI: 10.1016/j.procs.2019.09.445